Effective Fuzzy Keyword Search Technique in Cloud
نویسندگان
چکیده
منابع مشابه
Conjunctive Fuzzy Keyword Search Over Encrypted Data in Cloud Computing
As Cloud Computing becomes prevalent, more and more sensitive information are centralized into the cloud. For the protect data privacy, sensitive data usually have to be encrypted before outsourcing, which makes efficient data utilization a very challenging task. Although traditional searchable encryption schemes allow a user to search over encrypted data through keywords and selectively retrie...
متن کاملSearchable Encryption and Fuzzy Keyword Search in Cloud Computing Technology
Cloud computing is a technology that uses the internet and central remote servers to keep up data and applications. As becomes more mature, many organizations and individuals are attracted in storing more accessible data e.g. personal data files, company related information in the cloud. This technology allows for much more efficient computing by centralizing storage, memory, processing and ban...
متن کاملFuzzy Keyword Search over Encrypted Data in Cloud Computing.dvi
As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a very challenging task. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords a...
متن کاملAn ElGamal Encryption with Fuzzy Keyword Search on Cloud Environment
With the continuous development of cloud computing, more and more sensitive data needs to be centrally stored in the cloud storage. For protecting the privacy of data, sensitive data must be encrypted before being outsourced to the server. The traditional PEKS (Public Encryption Keyword Search) enables users to search data by using keywords in the condition of encryption, however, it not only n...
متن کاملEffective Keyword Search in Graphs
Keyword search in node-labeled graphs finds subtrees of the graph whose nodes contain all of the input keywords. Previous work ranks answer trees using combinations of structural and contentbased metrics, such as path lengths between keywords or relevance of the labels in the answer tree to the query keywords. We propose two new ways to rank keyword search results over graphs. The first takes n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/20820-3424